Strong Converse Theorems for Multimessage Networks with Tight Cut-Set Bound
نویسندگان
چکیده
This paper proves the strong converse for any discrete memoryless network (DMN) with tight cut-set bound, i.e., whose cut-set bound is achievable. Our result implies that for any DMN with tight cut-set bound and any fixed rate tuple that resides outside the capacity region, the average error probabilities of any sequence of length-n codes operated at the rate tuple must tend to 1 as n grows. The proof is based on the method of types. The proof techniques are inspired by the work of Csiszár and Körner in 1982 which fully characterized the reliability function of any discrete memoryless channel (DMC) with feedback for rates above capacity.
منابع مشابه
Strong Converse for Discrete Memoryless Networks with Tight Cut-Set Bounds
This paper proves the strong converse for any discrete memoryless network (DMN) with tight cut-set bound, i.e., whose cut-set bound is achievable. Our result implies that for any DMN with tight cut-set bound and any fixed rate tuple that resides outside the capacity region, the average error probabilities of any sequence of length-n codes operated at the rate tuple must tend to 1 as n grows. Th...
متن کاملStrong Converses Are Just Edge Removal Properties
This paper explores the relationship between two ideas in network information theory: edge removal and strong converses. Edge removal properties state that if an edge of small capacity is removed from a network, the capacity region does not change too much. Strong converses state that, for rates outside the capacity region, the probability of error converges to 1. Various notions of edge remova...
متن کاملCut-set Theorems for Multi-state Networks
We derive new cut-set bounds on the achievable rates in a general multi-terminal network with finite number of states. Multiple states are common in communication networks in the form of multiple channel and nodes’ states. Our results are broadly applicable and provide much tighter upper bounds than the known single state min-cut max-flow theorem, and hence form an important new tool to bound t...
متن کاملA Minimax Converse for Quantum Channel Coding
We prove a one-shot “minimax” converse bound for quantum channel coding assisted by positive partial transpose channels between sender and receiver. The bound is similar in spirit to the converse by Polyanskiy, Poor, and Verdú [IEEE Trans. Info. Theory 56, 2307–2359 (2010)] for classical channel coding, and also enjoys the saddle point property enabling the order of optimizations to be intercha...
متن کامل"Pretty strong" converse for the private capacity of degraded quantum wiretap channels
In the vein of the recent “pretty strong” converse for the quantum and private capacity of degradable quantum channels [Morgan/Winter, IEEE Trans. Inf. Theory 60(1):317333, 2014], we use the same techniques, in particular the calculus of min-entropies, to show a pretty strong converse for the private capacity of degraded classical-quantum-quantum (cqq-)wiretap channels, which generalize Wyner’s...
متن کامل